A Finite-State Approach to the Computational Morphology of Early Modern Greek
نویسندگان
چکیده
We present a finite-state approach to the computational morphology of early Modern Greek that improves the efficiency of searching and accessing to the “Politimo” corpus, which consists of Greek documents printed during the 17th and 18th centuries. Computational morphologies provide users the ability to search documents using only a word root and locate all the corresponding inflected words. Key-Words: Computational morphology, Finite state techniques, Natural language processing, Historical document processing
منابع مشابه
Morpho-Phonological Modelling in Natural Language Processing
In this paper we propose a computational model for the representation and processing of morpho-phonological phenomena in a natural language, like Modern Greek. We aim at a unified treatment of inflection, compounding, and word-internal phonological changes, in a model that is used for both analysis and generation. After discussing certain difficulties cuase by well-known finitestate approaches,...
متن کاملGreek Word Segmentation Using Minimal Information
Several computational simulations have been proposed for how children solve the word segmentation problem, but most have been tested only on a limited number of languages, often only English. In order to extend the cross-linguistic dimension of word segmentation research, a finite-state framework for testing various models of word segmentation is sketched, and a very simple cue is tested in thi...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملComputing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new approach is illustrated with an implemented fragment of Modern Hebrew verbs couched in MicroCUF, an expressive constraint logic formalism. For generation and parsin...
متن کاملVerbal Dvandvas in Modern Greek
While Greek is rich in compounds, one familiar type from Indo-European, namely dvandva compounds meaning 'X and Y', is essentially nonexistent in Ancient Greek. However, such compounds start occurring in post-Classical Greek and are fairly productive by early Modern Greek. The innovative dvandvas involve nouns, a type well attested elsewhere in Indo-European, but also verbs, such as aniγo-klino...
متن کامل